bound 2造句

• In this paper , we study an on - line version of the two - dimensional bin packing problem that is the problem of packing a list of rectangular items into a minimum number of unit - square bins in an on - line manner . an on - line algorithm called rtdh ( refined two dimensional harmonic ) is proposed and analyzed . we show that rtdh can achieve an asymptotic worst - case ratio of less than 2 . 7687 , which beats the best - known bound 2 . 85958
  目前，对该问题的研究有各种算法，主要有harmonic和round算法，本文针对harmonic和round算法存在的问题，提出一种算法rtdh ( refinedtwodimensionalharmonic ) ，做了相应的分析，并且给出了该算法的最坏性能比是2 . 7687的证明，这个结果刷新了目前最好的结果2 . 85958 。